The Knapsack Problem and Fully Polynomial Time Approximation Schemes (FPTAS)
نویسنده
چکیده
In the knapsack problem, you are given a knapsack of size B ∈ Z and a set S = {a1, . . . , an} of objects with corresponding sizes and profits s(ai) ∈ Z and p(ai) ∈ Z. The goal is to find the optimal subset of objects whose total size is bounded by B and has the maximum possible total profit. This problem is also sometimes called the 0/1 knapsack problem because each object must be either in the knapsack completely or not at all. There are other variations as well, notably the multiple knapsack problem, in which you have more than one knapsack to fill. The obvious greedy algorithm would sort the objects in decreasing order using the objects’ ratio of profit to size, or profit density, and then pick objects in that order until no more objects will fit into the knapsack. The problem with this is that we can make this algorithm perform arbitrarily bad.
منابع مشابه
A Faster FPTAS for the Unbounded Knapsack Problem
The Unbounded Knapsack Problem (UKP) is a well-known variant of the famous 0-1 Knapsack Problem (0-1 KP). In contrast to 0-1 KP, an arbitrary number of copies of every item can be taken in UKP. Since UKP is NP-hard, fully polynomial time approximation schemes (FPTAS) are of great interest. Such algorithms find a solution arbitrarily close to the optimum OPT(I), i.e. of value at least (1− ε)OPT(...
متن کاملAn FPTAS for the parametric knapsack problem
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problemmay need to output an exponential number of knapsack solutions. We present a fully polynomial-time approximation scheme (FPTAS...
متن کاملOptimization Problems with Approximation Schemes
In this paper we extend recent work about the relationship between the syntactic description of NP optimization problems and their approximation properties. In contrast to Max SNP we consider problems that take arbitrary weighted structures as input instances and we use the framework of Metaanite Model Theory 5] to get a more general deenability theory of optimization problems. We deene a class...
متن کاملA New Fully Polynomial Approximation Scheme for the Knapsack Problem
A new fully polynomial approximation scheme (FPTAS) is presented for the classical 0{1 knapsack problem. It considerably improves the space requirements. The two best previously known approaches need O(n+1=" 3) and O(n1=") space, respectively. Our new approximation scheme requires only O(n + 1=" 2) space while also reducing the running time.
متن کاملFully Polynomial Time Approximation Schemes
Recall that the approximation ratio for an approximation algorithm is a measure to evaluate the approximation performance of the algorithm. The closer the ratio to 1 the better the approximation performance of the algorithm. It is notable that there is a class of NP-hard optimization problems, most originating from scheduling problems, for which there are polynomial time approximation algorithm...
متن کاملImproved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem
In this paper the 0-1 Multiple-Choice Knapsack Problem (0-1 MCKP), a generalization of the classical 0-1 Knapsack problem, is addressed. We present a fast Fully Polynomial Time Approximation Scheme (FPTAS) for the 0-1 MCKP, which yields a better time bound than known algorithms. In particular it produces a (1+ ) approximate solution and runs in O(nm/ ) time, where n is the number of items and m...
متن کامل